Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
نویسندگان
چکیده
Upper bounds are given for the complexity of two very natural randomized algorithms for finding the sink of an Acyclic Unique Sink Orientation (AUSO) of the ncube. For Random-Edge, we obtain an upper bound of about 1.80n, improving upon the the previous upper bound of about 2n/nlogn obtained by Gärtner and Kaibel. For Random-Jump, we obtain an upper bound of about (3/2)n, improving upon the previous upper bound of about 1.72n obtained by Mansour and Singh. AUSOs provide an appealing combinatorial abstraction of linear programming and other computational problems such as finding optimal strategies for turn-based Stochastic Games.
منابع مشابه
Two New Bounds on the Random-Edge Simplex Algorithm
We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/ √ d pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a refined analysis that potentially yields much better bounds for specific classes of polytopes. As one application, we show that for combinatorial d-cubes, the trivi...
متن کاملTwo New Bounds for the Random-Edge Simplex-Algorithm
We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/ √ d pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a refined analysis that potentially yields much better bounds for specific classes of polytopes. As one application, we show that for combinatorial d-cubes, the trivi...
متن کاملRandomized Simplex Algorithms on Klee-Minty Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes [17] and similar linear programs with exponential decreasing paths. The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads t o (nearly) quadratic lower bounds for the complexity of linear programming with rando...
متن کاملRandomized Simplex Algorithms on Klee-Mintny Cubes
We investigate the behavior of randomized simplex algorithms on special linear programs. For this, we develop combinatorial models for the Klee-Minty cubes 16] and similar linear programs with exponential decreasing paths. The analysis of two randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus ...
متن کاملOn Moments of the Concomitants of Classic Record Values and Nonparametric Upper Bounds for the Mean under the Farlie-Gumbel-Morgenstern Model
In a sequence of random variables, record values are observations that exceed or fall below the current extreme value.Now consider a sequence of pairwise random variables {(Xi,Yi), i>=1}, when the experimenter is interested in studying just thesequence of records of the first component, the second component associated with a record value of the first one is termed the concomitant of that ...
متن کامل